Self-organizing actin waves that simulate phagocytic cup structures
نویسندگان
چکیده
منابع مشابه
Self-organizing actin waves that simulate phagocytic cup structures
This report deals with actin waves that are spontaneously generated on the planar, substrate-attached surface of Dictyostelium cells. These waves have the following characteristics. (1) They are circular structures of varying shape, capable of changing the direction of propagation. (2) The waves propagate by treadmilling with a recovery of actin incorporation after photobleaching of less than 1...
متن کاملSelf-Organizing Data Structures
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the un-sorted linear list, and the binary search tree. For the problem of maintaining unsorted lists, also known as the list update problem, we present results on the competitiveness achieved by deterministic and random-ized on-line algorithms. For binary search trees, we ...
متن کاملComputer Morphogenesis in Self-Organizing Structures
Applying biological concepts to create new models in the computational field is not a revolutionary idea: science has already been the basis for the famous artificial neuron models, the genetic algorithms, etc. The cells of a biological organism are able to compose very complex structures from a unique cell, the zygote, with no need for centralized control (Watson J.D. & Crick F. H. 1953). The ...
متن کاملA plasma membrane template for macropinocytic cups
Macropinocytosis is a fundamental mechanism that allows cells to take up extracellular liquid into large vesicles. It critically depends on the formation of a ring of protrusive actin beneath the plasma membrane, which develops into the macropinocytic cup. We show that macropinocytic cups in Dictyostelium are organised around coincident intense patches of PIP3, active Ras and active Rac. These ...
متن کاملSelf-Organizing Data Structures with Dependent Accesses
We consider self-organizing data structures in the case where the sequence of accesses can be modeled by a first order Markov chain. For the simple-kand batched-k–move-to-front schemes, explicit formulae for the expected search costs are derived and compared. We use a new approach that employs the technique of expanding a Markov chain. This approach generalizes the results of Gonnet/Munro/Suwan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PMC Biophysics
سال: 2010
ISSN: 1757-5036
DOI: 10.1186/1757-5036-3-7